منابع مشابه
Strong qualitative independence
The subsets A, B of the n-element X are said to be s-strongly separating if the two sets divide X into 4 sets of size at least s. The maximum number h(n, s) of pairwise s-strongly separating subsets was asymptotically determined by Frankl [8] for fixed s and large n. A new proof is given. Also, estimates for h(n, cn) are found where c is a small constant.
متن کاملProbabilistic Logic with Strong Independence
This papers investigates the manipulation of statements of strong independence in probabilistic logic. Inference methods based on polynomial programming are presented for strong independence, both for unconditional and conditional cases. We also consider graph-theoretic representations, where each node in a graph is associated with a Boolean variable and edges carry a Markov condition. The resu...
متن کاملHypergraph Domination and Strong Independence
We solve several conjectures and open problems from a recent paper by Acharya [2]. Some of our results are relatives of the Nordhaus–Gaddum theorem, concerning the sum of domination parameters in hypergraphs and their complements. (A dominating set in H is a vertex set D ⊆ X such that, for every vertex x ∈ X\D there exists an edge E ∈ E with x ∈ E and E∩D 6= ∅.) As an example, it is shown that ...
متن کاملIndependence and Qualitative Decision Theory
Probabilistic independence has proved to be a fundamental tool that can dramatically simplify the task of eliciting, representing, and computing with probabilities. We advance the position that notions of utility independence can serve similar functions when reasoning about preferences and utilities during decision making. In this paper we first summarize existing results and definitions concer...
متن کاملQualitative Combination of Independence Models
We deal with the problem of combining sets of independence statements coming from different experts. It is known that the independence model induced by a strictly positive probability distribution has a graphoid structure, but the explicit computation of the closure (w.r.t. graphoid properties) of a set of independence statements is a computational hard problem. For this, we rely on a compact s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00190-2